package bintree.searchtree;

import java.util.HashMap;

public class BSTTest {
    public static void main(String[] args) {
        int[] arr = {28,16,30,13,22,29,42};
        BST bst = new BST();
        for(int i:arr){
            bst.add(i);
        }
        System.out.println(bst.findMin());
        System.out.println(bst.findMax());
        bst.removeMin();
        bst.removeMax();
        System.out.println(bst);
        bst.removeValue(16);
        System.out.println(bst);
    }
}
